In-memory performance for big data

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

In-Memory Performance for Big Data

When a working set fits into memory, the overhead imposed by the buffer pool renders traditional databases noncompetitive with in-memory designs that sacrifice the benefits of a buffer pool. However, despite the large memory available with modern hardware, data skew, shifting workloads, and complex mixed workloads make it difficult to guarantee that a working set will fit in memory. Hence, some...

متن کامل

Safe Memory Regions for Big Data Processing

Recent work in high-performance systems written in man-aged languages (such as Java or C#) has shown that garbage-collection can be a significant performance bottleneck. Aclass of these systems, focused on big-data, create manyand often large data structures with well-defined lifetimes.In this paper, we present a language and a memory man-agement scheme based on user-man...

متن کامل

When can "big data" be "in-memory"?

The monikers of “big data” and “in-memory” are certainly hyped in the database world, but some people might argue that they don’t overlap. The terms are vague enough to be treated as mutually exclusive as well as mostly overlapping. In addition, “big data” often implies “data science” which means “not SQL” (based on some programmable framework like Map-Reduce, Spark, or Flink). How do we see th...

متن کامل

High performance solutions for big-data GWAS

In order to associate complex traits with genetic polymorphisms, genome-wide association studies process huge datasets involving tens of thousands of individuals genotyped for millions of polymorphisms. When handling these datasets, which exceed the main memory of contemporary computers, one faces two distinct challenges: 1) Millions of polymorphisms and thousands of phenotypes come at the cost...

متن کامل

Achieving High Performance for Big Data Analytics

Irregular algorithms such as graph algorithms, sorting, and sparse matrix multiplication, present numerous programming challenges that include scalability, load balancing, and efficient memory utilization. In this age of Big Data we face additional challenges since the data is often streaming at a high velocity and we wish to make near real-time decisions for real-world events. For instance, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the VLDB Endowment

سال: 2014

ISSN: 2150-8097

DOI: 10.14778/2735461.2735465